Qualified Logic Programming with Bivalued Predicates

Research on the field of uncertainty in logic programming has evolved during the last 25 years. In a recent paper [13] we have revised a classical approach by van Emden’s to Quantitative Logic Programming [19], generalizing it to a generic scheme QLP(D) for so-called Qualified Logic Programming over a parametrically given domain D, whose elements play the role of generalized truth values and can be used to qualify logical assertions. In this paper we present an extension of QLP(D) yielding a more expressive scheme BQLP(D), which supports a simple kind of negation based on bivalued predicates and allows threshold constraints in clause bodies in order to impose lower bounds to the qualifications computed by program clauses. The new scheme has a rigorous declarative semantics and a sound and strongly complete goal resolution procedure which can be efficiently implemented using constraint logic programming technology.